منابع مشابه
diffuse optical tomography: image reconstruction and verification
introduction: in this study, we intend to use diffuse optical tomography (dot) as a noninvasive, safe and low cost technique that can be considered as a functional imaging method and mention the importance of image reconstruction in accuracy and procession of image. one of the most important and fastest methods in image reconstruction is the boundary element method (bem). this method is introdu...
متن کاملGraph Reconstruction
In 1941 Kelly and Ulam proposed the Graph Reconstruction Conjecture, and it has remained an open problem to this day[3]. The Graph Reconstruction Conjecture states simply that any simple finite undirected graph on 3 or more vertices can be uniquely identified (up to isomorphism) by the multiset of its unlabeled 1-vertex-deleted subgraphs. There are no known counter-examples to the Conjecture, a...
متن کاملGraph-IC Verification
In this paper, we describe the application of graph-based verification techniques to a complex and highly configurable display controller IP block. The main challenges, the technology and the major benefits are developed, including the reuse at system level for basic connectivity verification and more complex system-level tests involving multiple IPs.
متن کاملVerification of graph programs
This thesis is concerned with verifying the correctness of programs written in GP 2 (for Graph Programs), an experimental, nondeterministic graph manipulation language, in which program states are graphs, and computational steps are applications of graph transformation rules. GP 2 allows for visual programming at a high level of abstraction, with the programmer freed from manipulating low-level...
متن کاملUsing Graph Transformations and Graph Abstractions for Software Verification
In this paper we describe our intended approach for the verification of software written in imperative programming languages. We base our approach on model checking of graph transition systems, where each state is a graph and the transitions are specified by graph transformation rules. We believe that graph transformation is a very suitable technique to model the execution semantics of language...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2018
ISSN: 1549-6325,1549-6333
DOI: 10.1145/3199606